Tournaments for Ideas
نویسنده
چکیده
Governments and foundations have successfully harnessed tournaments to spur innovation. Yet this tool is not widely used by firms. We offer a framework for managers seeking to organize tournaments for ideas. We present the theoretical underpinnings of tournaments. We then connect the theory with three recent innovations—the power of the network, the wisdom of crowds, and the power of love—that boost the effectiveness of tournaments. Short cases and academic studies are used to illustrate our framework.
منابع مشابه
t-Pancyclic Arcs in Tournaments
Let $T$ be a non-trivial tournament. An arc is emph{$t$-pancyclic} in $T$, if it is contained in a cycle of length $ell$ for every $tleq ell leq |V(T)|$. Let $p^t(T)$ denote the number of $t$-pancyclic arcs in $T$ and $h^t(T)$ the maximum number of $t$-pancyclic arcs contained in the same Hamiltonian cycle of $T$. Moon ({em J. Combin. Inform. System Sci.}, {bf 19} (1994), 207-214) showed that $...
متن کاملA proof of Sumner's universal tournament conjecture for large tournaments
Sumner’s universal tournament conjecture states that any tournament on 2n−2 vertices contains any directed tree on n vertices. In this paper we prove that this conjecture holds for all sufficiently large n. The proof makes extensive use of results and ideas from a recent paper by the same authors, in which an approximate version of the conjecture was
متن کاملA Further Step Towards an Understanding of the Tournament Equilibrium Set
We study some problems pertaining to the tournament equilibrium set (τ for short). A tournament H is a τ-retentive tournament if there is a tournament T which has a minimal τ-retentive set R such that T [R] is isomorphic to H. We study τ-retentive tournaments and achieve many significant results. In particular, we prove that there are no τretentive tournaments of size 4, only 2 non-isomorphic τ...
متن کاملPath - connect iv i ty in local tournaments 1
A digraph T is called a local tournament if for every vertex x of T, the set of in-neighbors as well as the set of out-neighbors of x induce tournaments. We give characterizations of generalized arc-pancyclic and strongly path-panconnected local tournaments, respectively. Our results generalize those due to Bu and Zhang (1996) about arc-pancyclic local tournaments and about strongly arc-pancycl...
متن کاملLocal Tournaments and In - Tournaments
Preface Tournaments constitute perhaps the most well-studied class of directed graphs. One of the reasons for the interest in the theory of tournaments is the monograph Topics on Tournaments [58] by Moon published in 1968, covering all results on tournaments known up to this time. In particular, three results deserve special mention: in 1934 Rédei [60] proved that every tournament has a directe...
متن کامل